A Limit Theory for Random Skip
نویسنده
چکیده
The skip list was introduced by Pugh in 1989 as a data structure for dictionary operations. Using a binary tree representation of skip lists, we obtain the limit law for the path lengths of the leaves in the skip list . We also show that the height (maximal path length) of a skip list holding n elements is in probability asymptotic to c log, / n, where c is the unique solution greater than 1 of the equation log(1 p) = log(c 1) [c/(c " 1)] log c, and p E (0,1) is a design parameter of the skip list .
منابع مشابه
Some Results for Skip-free Random Walk
A random walk that is skip-free to the left can only move down one level at a time but can skip up several levels. Such random walk features prominently in many places in applied probability including queuing theory and the theory of branching processes. This article exploits the special structure in this class of random walk to obtain a number of simplified derivations for results that are muc...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملReliability analysis of rubble-mound breakwaters against the failure due to the armor layer instability based on the fuzzy random variables theory: A case study of Anzali Port breakwater
Breakwaters are among the most frequently-used coastal protective structures and their stability is vital to avoid turbulence at the ports. The main purpose of the present research is to use the theory of fuzzy random variables and the second-order reliability method (SORM) to study the reliability of a rubble-mound breakwater against the failure due to the armor layer instability. The limit-st...
متن کاملEarly Skip Decision based on Merge Index of SKIP for HEVC Encoding
The high efficiency video coding (HEVC) standard has significantly improved the coding efficiency by adopting a number of new coding tools. However enormous computational complexity is introduced by recursive rate-distortion optimization and new coding tools. In this paper, early SKIP decision method is proposed based on merge index of SKIP. There is high possibility that SKIP is selected as op...
متن کاملAsymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
We study the random variable B(c, n), which counts the number of balls that must be thrown into n equally-sized bins in order to obtain c collisions. The asymptotic expected value of B(1, n) is the well-known √ nπ/2 appearing in the solution to the birthday problem; the limit distribution and asymptotic moments of B(1, n) are also well known. We calculate the distribution and moments of B(c, n)...
متن کامل